Three extensional models of type theory

نویسنده

  • Benno van den Berg
چکیده

Martin-Löf’s type theory exists in two forms, differing in the formalisation of the identity types. In [15] Per Martin-Löf formulated his type theory with the extensional rules for the identity types, identifying judgmental and propositional equality. This rendered type-checking and well-formedness of formulas undecidable. For this reason (among others), he latter formulated intensional rules for the identity type that do preserve the decidability of type-checking and well-formedness of formulas. For this reason, the intensional version is adopted by most implementations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kripke Semantics for Martin-Löf's Extensional Type Theory

It is well-known that simple type theory is complete with respect to nonstandard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly, dependent type theory is complete for locally cartesian closed categories. However, it is usually difficult to establish the coherence of inte...

متن کامل

POWERSET OPERATORS OF EXTENSIONAL FUZZY SETS

Powerset structures of extensional fuzzy sets in sets with similarity relations are investigated. It is proved that extensional fuzzy sets have powerset structures which are powerset theories in the category of sets with similarity relations, and some of these powerset theories are defined also by algebraic theories (monads). Between Zadeh's fuzzy powerset theory and the classical powerset theo...

متن کامل

Internalization of the Groupoid Interpretation of Type Theory

Homotopical interpretations of Martin-Löf type theory lead toward an interpretation of equality as a richer, more extensional notion. Extensional or axiomatic presentations of the theory with principles based on such models do not yet fully benefit from the power of dependent type theory, that is its computational character. Reconciling intensional type theory with this richer notion of equalit...

متن کامل

The Syntax and Semantics ofQuantitative Type Theory

Type Theory offers a tantalising promise: that we can program and reason within a single unified system. However, this promise slips away when we try to produce efficient programs. Type Theory offers little control over the intensional aspect of programs: how are computational resources used, and when can they be reused. Tracking resource usage via types has a long history, starting with Girard...

متن کامل

Reasoning in Extensional Type Theory with Equality

We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compact representation of cut-free (ground) proofs as extensional expansion dags. Automated proof search can be realized using a few operations to manipulate extensional expansion dags with variables. These search operations form a b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2009